brute force *800

Please click on ads to support us..

Python Code:

n = int(input())
d = {1: 'A', 2: 'C', 3: 'B', 0: 'D'}
tt = {1: 4, 3: 3 , 2: 2, 0: 1}
a = 0
h = tt[n % 4]
for i in range(1,3):
    if(tt[(n+i)%4] > h):
        a = i
        h = tt[(n + i)%4]
print(a, d[(n+a)%4])

C++ Code:

#include <iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    int x=n%4;
    if(x==1){
        cout<<0<<" "<<"A";
    }
    else if(x==2)
   {
       cout<<1<<" "<<"B";
   }
   else if(x==3){
       cout<<2<<" "<<"A";
   }
   else if(x==0){
       cout<<1<<" "<<"A";
   }
return 0;  
}
		 		  		 	 	 		 	 	        		


Comments

Submit
0 Comments
More Questions

39F - Pacifist frogs
1451C - String Equality
386A - Second-Price Auction
1690E - Price Maximization
282B - Painting Eggs
440A - Forgotten Episode
233B - Non-square Equation
628B - New Skateboard
262B - Roma and Changing Signs
755C - PolandBall and Forest
456B - Fedya and Maths
376B - IOU
1623B - Game on Ranges
1118A - Water Buying
1462C - Unique Number
301A - Yaroslav and Sequence
38A - Army
38C - Blinds
1197A - DIY Wooden Ladder
1717D - Madoka and The Corruption Scheme
1296D - Fight with Monsters
729D - Sea Battle
788A - Functions again
1245B - Restricted RPS
1490D - Permutation Transformation
1087B - Div Times Mod
1213B - Bad Prices
1726B - Mainak and Interesting Sequence
1726D - Edge Split
1726C - Jatayu's Balanced Bracket Sequence